The Cycle Spectrum of Claw-free Hamiltonian Graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian N2-locally connected claw-free graphs
A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjác̆ek conjectured that every 3-connected N2-locally connected claw-free graph is hamiltonian. This conjecture is proved in this note.
متن کاملUnifying Results on Hamiltonian Claw-free Graphs
This work was motivated by many (recent) papers on hamiltonicity of claw-free graphs, i.e. graphs that do not contain K 1;3 as an induced sub-graph. By combining ideas from these papers with some new observations, we unify several of the existing suuciency results, using a new suucient condition consisting of seven subconditions. If each pair of vertices at distance two of a 2-connected claw-fr...
متن کاملHamiltonian Connectedness in Claw-Free Graphs
Let A be a ®nite abelian group and G be a digraph. The boundary of a function f : E G 7! A is a function q f : V G 7! A given by q f v Pe leaving v f eÿ P e entering v f e. The graph G is A-connected if for every b : V G 7! A with P v AV G b v 0, there is a function f : E G 7! Aÿ f0g such that q f b. In [J. Combinatorial Theory, Ser. B 56 (1992) 165±182], Jaeger et al showed th...
متن کاملOn uniquely Hamiltonian claw-free and triangle-free graphs
A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian. We also show that this is best possible by exhibiting uniquely Hamiltonian claw-free graphs with minimum degree 2 and arbitrary maximum degree. Finally, we show that a construction due to Entringer and Swart can b...
متن کاملClaw-free 3-connected P11-free graphs are hamiltonian
We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there exist non-hamiltonian 3-connected claw-free graphs without induced copies of P12 this result is, in a way, best possible. 1. Statement of the main result A graph G is {H1, H2, . . . Hk}-free if G contains no induced subgraphs isomorphic to any of the graphs Hi, i = 1, 2, . . . , k. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2015
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-015-1530-9